Truthfulness in Advertising? Approximation Mechanisms for Knapsack Bidders
نویسندگان
چکیده
Quasilinear utility functions are a standard assumption in auction theory allowing for truthful and welfare-maximizing auction mechanisms. However, the literature on advertising markets suggests that the utility model of bidders rather resembles a knapsack problem, where advertisers try to maximize the sum of item values subject to a budget for a marketing campaign. Non-quasilinear environments rarely allow for truthful mechanisms. However, some characteristics of the market environment might allow for positive results. In particular, markets are large and bidders typically consider prices as exogenous. We introduce a model of advertising markets, and study whether truthful and prior-free approximation mechanisms with good approximation ratios of the maximal welfare are possible. We analyze the offline mechanism design problem and find a truthful and randomized mechanism with an approximation ratio of only 4. This mechanism draws on a fractional deferred acceptance algorithm and randomized rounding, and it illustrates how the relax-and-round principle can be implemented in this non-quasilinear environment. The article highlights the types of assumptions necessary for truthful mechanisms with good approximation ratios in an important class of non-quasilinear utility functions.
منابع مشابه
Truthfulness with Value-Maximizing Bidders
In markets such as digital advertising auctions, bidders want to maximize value rather than payoff. This is different to the utility functions typically assumed in auction theory and leads to different strategies and outcomes. We refer to bidders who maximize value as value bidders. While simple single-object auction formats are truthful, standard multi-object auction formats allow for manipula...
متن کاملTruthfulness with value-maximizing bidders: On the limits of approximation in combinatorial markets
In some markets bidders want to maximize value subject to a budget constraint rather than payoff. This is different to the quasilinear utility functions typically assumed in auction theory and leads to different strategies and outcomes. We refer to bidders who maximize value as value bidders. While simple single-object auction formats are truthful, standard multi-object auction formats allow fo...
متن کاملA The Computational Complexity of Truthfulness in Combinatorial Auctions
Is it possible to design truthful polynomial-time mechanisms that achieve a good approximation ratio? This is one of the basic questions in Algorithmic Mechanism Design. The focus of most of the work on this question is on settings in which on one hand there exists a truthful algorithm that maximizes the social welfare (VCG), but on the other hand computing the optimal solution is computational...
متن کاملA Truthfulness and Stochastic Dominance with Monetary Transfers
We consider truthfulness concepts for auctions with payments based on firstand second-order stochastic dominance. We assume bidders consider wealth in standard quasi-linear form as valuation minus payments. Additionally, they are sensitive to risk in the distribution of wealth stemming from randomized mechanisms. Firstand second-order stochastic dominance are well-known to capture risk-sensitiv...
متن کاملA universally-truthful approximation scheme for multi-unit auctions
We present a randomized, polynomial-time approximation scheme for multi-unit auctions. Our mechanism is truthful in the universal sense, i.e., a distribution over deterministically truthful mechanisms. Previously known approximation schemes were truthful in expectation which is a weaker notion of truthfulness assuming risk neutral bidders. The existence of a universally truthful approximation s...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2017